Distributed Algorithms of Finding the Unique Minimum Distance Dominating Set in Directed Split-Stars
نویسندگان
چکیده
A distance-k dominating set S of a directed graph D is a set of vertices such that for every vertex v of D, there is a vertex u ∈ S at distance at most k from it. Minimum distance-k dominating set is especially important in communication networks for distributed data structure and for server placement. In this paper, we shall present simple distributed algorithms for finding the unique minimum distance-k dominating set for k = 1, 2 in a directed split-star, which has recently been developed as a new model of the interconnection network for parallel and distributed computing systems.
منابع مشابه
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
A distance-k dominating set S of a directed graph D is a set of vertices such that for every vertex v of D, there is a vertex u ∈ S at distance at most k from it. Minimum distance-k dominating set is especially important in communication networks for distributed data structure and for server placement. In this paper, we shall present simple distributed algorithms for finding the unique minimum ...
متن کاملA Distributed Algorithm for Minimum Distance-k Domination in Trees
While efficient algorithms for finding minimal distance-k dominating sets exist, finding minimum such sets is NP-hard even for bipartite graphs. This paper presents a distributed algorithm to determine a minimum (connected) distance-k dominating set and a maximum distance-2k independent set of a tree T . It terminates in O(height(T )) rounds and uses O(log k) space. To the best of our knowledge...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کامل